Sharing and Bandwidth Consumption in the Low Bandwidth File System

The Low Bandwidth Network File System (LBFS) was designed to minimize the bandwidth requirements for running interactive applications and accessing remote files over bandwidthconstrained network links. We present a simplified implementation of the original LBFS in which we concentrate on the analysis of the chunking algorithm used to exploit similarities across files. We propose an optimized version of Rabin’s chunking algorithm and evaluate the net savings in bandwidth using this new algorithm. In this process, we verify the claims of the original LBFS paper and demonstrate the efficiency of our algorithm.